Generic case completeness
نویسندگان
چکیده
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
منابع مشابه
Assessment of the completeness of Volunteered Geographic Information focusing on building blocks data (Case Study: Tehran metropolis)
Open Street Map (OSM) is currently the largest collection of volunteered geographic data, widely used in many projects as an alternative to or integrated with authoritative data. However, the quality of these data has been one of the obstacles to the widely use of it. In this article, from among the elements related to the quality of volunteered geographic data, we have tried to examine the com...
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملOn completeness results for predicate
In this paper we deal with generic expansions of first-order predicate logics of some left-continuous t-norms with a countable set of truth-constants. Besides already known results for the case of Lukasiewicz logic, we obtain new conservativeness and completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics wit...
متن کاملOn the Completeness of Dynamic Logic
The impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: “local” semantic completeness on the one hand (Cook’s relative completeness, Harel’s Arithmetical completeness), and completeness with respect to other forms of reasoning about programs, on the other. However, local semantic complete...
متن کاملA Generic NP-hardness Proof for a Variant of Graph Coloring
In this note, a direct proof is given of the NP-completeness of a variant of Graph Coloring, i.e., a generic proof is given, similar to the proof of Cook of the NPcompleteness of Satisfiability. Then, transformations from this variant of Graph Coloring to Independent Set and to Satisfiability are given. These proofs could be useful in an educational setting, where basics of the theory of NP-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 82 شماره
صفحات -
تاریخ انتشار 2016